A high performance ECC hardware implementation with instruction-level parallelism over GF(2163)
نویسندگان
چکیده
In this work we propose a high performance elliptic curve cryptographic processor over GF(2) for the applications that require high performance. It has three finite field (FF) RISC cores and a main controller to achieve instruction-level parallelism (ILP) for elliptic curve point multiplication. Customized instructions are proposed to decrease clock cycles. The interconnection among three FF cores and the main controller is obtained based on the analysis of both data dependency and critical path. The proposed design can reach 185 MHz with 20,807 slices when implemented on Xilinx XC4VLX80 FPGA device and 263 MHz with 217,904 gates when synthesized with TSMC .18 lm CMOS technology. 2010 Elsevier B.V. All rights reserved.
منابع مشابه
High-performance Public-key Cryptoprocessor for Wireless Mobile Applications
We present a high-speed public-key cryptoprocessor that exploits three-level parallelism in Elliptic Curve Cryptography (ECC) over GF(2n). The proposed cryptoprocessor employs a Parallelized Modular Arithmetic Logic Unit (P-MALU) that exploits two types of different parallelism for accelerating modular operations. The sequence of scalar multiplications is also accelerated by exploiting Instruct...
متن کاملSuperscalar Coprocessor for High-Speed Curve-Based Cryptography
We propose a superscalar coprocessor for high-speed curvebased cryptography. It accelerates scalar multiplication by exploiting instruction-level parallelism (ILP) dynamically and processing multiple instructions in parallel. The system-level architecture is designed so that the coprocessor can fully utilize the superscalar feature. The implementation results show that scalar multiplication of ...
متن کاملHigh-Performance Pipelined Architecture of Elliptic Curve Scalar Multiplication Over GF(2m)
This paper proposes an efficient pipelined architecture of elliptic curve scalar multiplication (ECSM) over GF(2 m ). The architecture uses a bit-parallel finite field (FF) multiplier accumulator (MAC) based on the Karatsuba–Ofman algorithm. The Montgomery ladder algorithm is modified for better sharing of execution paths. The data path in the architecture is well designed, so that the critical...
متن کاملHW/SW Co-design for Accelerating Public-Key Cryptosystems over GF(p) on the 8051 μ-controller
Implementing large word-length public key algorithms on small 8-bit μ-controllers is a challenge. This paper presents a hardware/software co-design solution of RSA and Elliptic Curve Cryptography (ECC) over GF(p) on a 12 MHz 8-bit 8051 μ-controller. The hardware coprocessor has a modular arithmetic logic unit (MALU) of which the digit size (d) is variable. It can be adapted to the speed and ban...
متن کاملOn the Design of Projective Binary Edwards Elliptic Curves over Gf (p) Benefiting from Mapping Elliptic Curves Computations to Variable Degree of Parallel Design
ـ ـــ Finding multiplicative inverse (Modular Inversion) operation is the most time-consuming operation in Elliptic Curve Crypto-system (ECC) operations which affects the performance of ECC. Moreover, several factors that affect the design of ECC have not been intensively investigated in the majority of researches related to ECC, Such as system utilization, area, resources-consuming and area*ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Microprocessors and Microsystems - Embedded Hardware Design
دوره 34 شماره
صفحات -
تاریخ انتشار 2010